To design and develop user-oriented, flexible and distributed applications which can deal with various users' requirements, new technologies to manage, control and utilize the services of communication networks have to be provided. In this paper, the current challenges faced by large-scale distributed applications are discussed and a framework for the next generation network operation and management is presented on the basis of agent-based computing technologies. Examples of flexible distributed applications are presented to clarify the role of application-centric flexible network operation and management.

A packet-based leaky-bucket algorithm functions like the early packet discard (EPD), and accepts a newly arriving packet if the probability that all the cells of the packet are accepted is high. We derive some performance characteristics of the cell and packet arrival processes that are accepted by the leaky-bucket algorithm. From these analyses, a method to determine the values of the parameters of the leaky-bucket algorithm and certain relations between this leaky-bucket algorithm and the generic cell rate algorithm (GCRA) are obtained.

Telecommunication technologies are making relentless progress. In this circumstance, network cost must be evaluated to assess the effectiveness of emerging technologies. To do such an evaluation efficiently, it is necessary to develop a software tool that can calculate the network cost independent of the employed technologies. This paper describes computational techniques used in developing such a software tool. First, the functional requirements are identified to establish a flexible tool that is applicable to a wide range of technologies. One of the required functions is the function that computes the resource amount and the network cost from the given conditions such as traffic demands, a cable duct network, multiplex hierarchy and the specifications of network elements employed. As this computing function, the paper proposes an appropriate path classification scheme that enables us to evaluate the resource amount correctly when a service protection technique is applied to the target network. Namely, the proposed scheme yields evaluations that isolate the primary path route from the backup path route. This isolation is not always provided without classification. In addition, a classification of network elements is also derived for valid estimation of the necessary interface board number, which is a basis of estimating the required network element amount. This classification allows us to identify the exact points of path cross-connection and termination, which affects the number of interface boards. This paper presents the computing procedures that realize path grouping and an estimation of network elements using these classification schemes. Finally, the paper describes a prototype of the tool to confirm the feasibility and effectiveness of the proposed schemes.

This paper studies the routing algorithms for multi-destination connections where each destination may require different amount of data streams. This asymmetric feature can arise mostly in a large and/or heterogeneous network environment. There are mainly two reasons for this. One is that terminal equipments may have different capabilities. The other is that users may have various interests in the same set of information. We first define the asymmetric multicast problem and describe an original routing method for this type of multicast. The method is then employed in the presented routing algorithms, which can be run in multi-cluster environment. The multi-cluster architecture is considered to be effective for running routing in the networks, where a variety of operating methods might be applied in different clusters but global network performance is required. Our algorithms are designed based on some classical Steiner tree heuristics. The basic goal of our algorithms is to make routing decisions for the asymmetric multicast connections with minimum-cost purpose. In addition, we also consider delay constraint requirements in the multicast connections and propose correspondent algorithms. We compare the performance between SPT (Shortest Path Tree)-based algorithms and the presented algorithms by simulations. We show that performance difference exists among the different types of the algorithms.

The TMN that appears to operate the various communication networks generally and efficiently is developed under the different platform environment such as the different hardware and the different operating system. One of the main problems is that all the agents of the TMN system must be duplicated and maintain the software and the data blocks that perform the identical function. Therefore, the standard of the Q3 interface development cannot be defined and the multi-platform cannot be supported in the development of the TMN agent. In order to overcome these problems, the Farming methodology that is based on the Farmer model has been suggested. The main concept of the Farming methodology is that the software and the data components that are duplicated and stored in each distributed object are saved in the Platform Independent Class Repository (PICR) by converting into the format of the independent componentware in the platform, so that the componentwares that are essential for the execution can be loaded and used statically or dynamically from PICR as described in the framework of each distributed object. The distributed TMN agent of the personal communication network is designed and developed by using the Farmer model.

This paper proposes the Snow Crystal method, which aims to present the hierarchies of a large-scale telecommunication network on one screen. This will improve the user interface of a network operation system for network operations and management. With the proposed presentation method, locations of nodes are automatically set based on the number of hierarchy levels and the number of nodes. The nodes in the same hierarchy level are located on the same circle at even intervals. The center of the circle that corresponds to the top hierarchy level is set at the center of the screen. The radius of the circle is determined by the number of nodes. The centers of circles that correspond to the second hierarchy levels belonging to the nodes of the top hierarchy level, are located on a larger circle with the same center point as the top level circle at even intervals. The centers of circles that correspond to the third hierarchy levels are located at even intervals on a circle with the same center point as the second level circle, which the third levels belong to. The nodes of the subsequent levels are located in the same way. The proposed presentation method is successfully applied to a large-scale telecommunication network. Moreover, the results of an operating experiment with the proposed method show its effectiveness for presenting hierarchies of large-scale telecommunication networks.

A Time-Division Multiplexed (TDM) Hierarchical Switching System (HSS), proposed by Eng and Acampora [5], provides any size of bandwidth for a number of subscribers by allocating proper number of time-slots in a frame. In this paper, we present a binary time-slot assignment (TSA) algorithm by which a proper size of time-slots in the frame are allocated to each subscriber so as to meet its bandwidth requests. The time complexity of the proposed algorithm is O(NLlog2 L) in which N is the number of input/output links of the central switch and L is the number of time-slots allotted to each link in the frame. As the authors know, the most efficient algorithm proposed in the literature has time complexity of O(min(L, M2)min(N, M)M2), in which M is the number of subscribers that is larger than N in TDM/HSS system. To give a clear idea of relative efficiency between two algorithms, let us give a typical situation of M = L = O(N2). In this configuration our algorithm makes a significant improvement in time complexity by the order of O(M2/log2M).

Significant traffic variations occur in telecommunication networks. This paper focuses on hour-to-hour traffic variations during 24 hours and investigates the possibility of using idle periods effectively by introducing non-realtime service at a discount rate. In order to provide non-realtime service, memory is placed at each telecom center. When immediate service is not available, messages of non-realtime calls are stored in the memory and served later when network resources are available. Realtime calls are served with preference. A basic model and a method of dimensioning the memory capacity are presented. The basic model is extended to the network model, and methods of designing a minimum cost network and pricing and profit issues are presented. The results for a basic model are verified by traffic simulation. Numerical examples are given to show the effectiveness of non-realtime service.

The Guaranteed Bandwidth Protocol (GBW) is an access scheme being proposed for implementation of connection oriented services in DQDB networks. Connection oriented services are expected to handle both constant bit rate (CBR) and variable bit rate (VBR) traffic that have delay and jitter constraints. It has been reported that the GBW protocol can provide guaranteed bandwidth and lower delays compared to the ordinary DQDB protocol. However, the intensity of the jitter introduced by this scheme has not been made clear. This paper compares the jitter results for the GBW scheme to those obtained by a new access method called Modified Guaranteed Bandwidth (MOD_GBW) protocol, which is proposed here. It is shown through simulation that MOD_GBW also provides guaranteed bandwidth and that its delay and jitter characteristics are significantly better than those of the GBW protocol. In the simulation model, the DQDB stations are divided into two groups: 1)Real-Time (RT) stations that generate either CBR or VBR real-time traffic; and 2)Data stations that generate memoryless type of traffic. Data stations operate according to the ordinary DQDB protocol only. The main performance measure adopted here for the real-time traffic is the interdeparture time distribution of consecutive segments from an RT-station. We define the variance of this distribution as jitter. This paper also shows the impact of GBW/MOD_GBW on the performance of the data stations by evaluating their throughput and average bus access delay. Finally, we show that the network performance is weakly related to the number of RT-stations under MOD_GBW, but it depends strongly on the overall loading.

Recently, there have been intensive studies on protocol methods and applications of short range inter-vehicle communication network (SR-IVCN) and systems. The purpose of the studies is to improve the safety of road traffic systems and the smooth control of the traffic flow by providing information to vehicles. Spread spectrum (SS) communication systems are able to simultaneously communicate and measure the distance between the terminals, thus it is advantageous to apply the spread spectrum technique to inter-vehicle communications. This paper assumes that the vehicles incidentally close to each other, form and manage a locally autonomous decentralized dynamic network. An R-ALOHA (Reservation-ALOHA) protocol for the spread spectrum inter-vehicle communication network using head spacing information is proposed which improve the conventional slot reservation methods. Since the near-far problem in SS communication is one reason for the degradation of system performance, this proposed scheme is shown to improve the efficiency of communication. The performance of the proposed system in the environment where the vehicles are assumed to run freely on a highway is verified by computer simulation. It is shown that inter-vehicle communication can be smoothly carried out between one vehicle and the surrounding vehicles using the propose method.

The evolution of access networks towards Fiber-To-The-Home (FTTH) receives much attention throughout the world because FTTH has a big potential for providing future attractive services. To provide such services in terms of transmission rate, the cable network transition scenario from conventional copper cable network to optical fiber cable one in access field should be clarified. Since network transition scenario deeply depends on the service evolution scenarios (what type of service would appear at a certain time and how many customers move to the other services, for example), this paper firstly categorizes telecommunication services into four kinds of services, i.e. Basic Service (e.g. POTS), Narrowband Symmetrical Service (e.g. NISDN), Broadband Asymmetrical Services (e.g. Video-On-Demand) and Broadband Symmetrical Services (e.g. BISDN) in terms of up-and down-stream transmission rates. Based on this service categorization, it is proposed to formalize service evolution scenarios by a transition pattern of the initial demands and the penetration rates of these services. Then, the evaluation method of network transition scenarios is also proposed in terms of NPV by the service evolution scenarios. It is conclude that the network transition scenarios are deeply related to the amount and behavior of the demands moving to the other services as follows.-The scenario where the new system configuration partly replaces the old one whenever the demands appear for providing higher transmission rate services is applicable, when the demands move little or constantly move to the higher transmission rate services,-The scenario where the new system configuration totally replaces the old one at the early stage for providing all services is applicable, when the demands drastically move to the higher transmission rate services during short period.

In this paper, a feasible optical code-division multiple-access (CDMA) technique is proposed for high-speed computer networks using prime codes and optical signal processing to guarantee real-time data communications. All-optical architectures for fastly tunable CDMA encoders and decoders are presented, which can be feasibly implemented in the optical domain by using electrooptic switches and optical delay lines. This can support an ultrahigh throughput and a very fast reconfiguration time. Furthermore, we present a self-synchronized sample technique to ensure the correct phase synchronization between optical clock stream and asynchronous electronic data at each electrooptic modulator of an optical CDMA transmitter.

We study the capacity assignment and routing procedure for a simultaneous multipoint-to-point communication network called convergence cast communication (con-cast). In capacity assignment, we analyse the network in two different application model, single destination and variable destination concast group. In each model, we determine the optimal capacity and network configuration. In routing procedure, since the problem is computationally intractable[1], [2], we present a heuristic algorithm that, under condition of the capacity constraint, selects a set of connections for n-1 separated points to one point. This is accomplished by considering a hierarchical structure and a flow decomposition technique in the network. The algorithm finds a solution for connection assignment in convergence-type communications. Theoretical analysis and computer simulation of the proposed method are given.

In this paper, we formulate and solve a discrete-time queueing problem that has two potential applications: ATM multiplexers and DQDB networks. We first consider the modeling of an ATM multiplexer. The object of the analysis is a periodic traffic stream (CBR traffic), which is one of the inputs to the multiplexer. As in previous works of the subject, we consider a memoryless background traffic input. Here, in addition to this background traffic, we take into account the influence of a high-priority traffic, which is time-correlated and requires expedited service. We analyze the influence of these two types of traffic on the statistics of the interdeparture time (jitter process) and the delay of the periodic traffic stream. We obtain their distributions in a form of z-transforms, and from these we derive closed form expressions for the average delay and the variance of the interdeparture time. Our results show that the delay and jitter are very sensitive to the burstiness of the high priority traffic arrival process. We next apply our analytical modeling to a DQDB network when some of its stations are driven by CBR sources. We can obtain interesting results concerning the influence of the physical location of a DQDB station on the jitter.

A performance estimation method has been developed that combines conventional performance evaluation with Bayesian regression analysis. The conventional method is used to estimate performance a priori; this a priori estimate is then updated through Bayesian regression analysis using monitored performance. This method compensates for modeling errors in the conventional technique without recreating complex performance models; it does not require additional traffic measurement or system behavior models. Numerical examples and applications of traffic management in ATM PVC networks have demonstrated its effectiveness.

This paper proposes a protocol verification tool where protocols are described in an extended Petri net and Horn clauses. The extended net model contributes to reduce state space in verification with hierarchical description. The model also includes timed and colored net. Horn clause enables protocol designers to grasp a protocol by the declarative semantics. They can describe non critical but mandatory portion of a protocol like error processing or abortion with Horn clauses. Protocols are verified through simulation. Protocol verification includes two methods, all-in-one and hierarchical methods. By the all-in-one method all description is translated into Prolong clause and simulated exhaustively, whereas by the hierarchical verification, simulation begins with the lowest layer and deduces sufficient conditions that give liveness and safeness of the net model. Then the layer is replaced by a simpler net model that is incorporated into the higher layer. The scheme is applied to an illustrative example of the Alternating Bit protocol to discuss its effectiveness.

A method is proposed for locating large gas leaks in subscriber cable networks composed of different type cables and/or branch cables that uses pressures periodically measured at several points. Theoretical pressure curves corresponding to these measured pressure curves are calculated using a model representing the actual cable network. These curves are called the calculated pressure curves. The position of the leak is varied in the calculation model and where the measured and calculated pressure curves coincide the most, the leak position in the calculation model indicates the estimated leak position. The calculated pressure curves are based on the Laplace transform and an analogy between the pneumatic characteristics in cable networks and the electrical characteristics in electrical transmission networks. An experiment using a cable network about 910m long resulted in a location error of less than 30m.

Currently there is considerable world-wide speculation regarding the introduction of optical fiber cable into access networks, because optical fiber has a big potential for providing attractive multimedia services. Since optical fiber cable can provide a variety of grade of services, high-reliability of cable networks would be required compared with the conventional copper cable networks. To develop multimedia telecommunication networks as an infrastructure, it is urgent to clarify the highly reliable optical fiber cable network architecture. Since cable network architecture deeply depends on regional conditions such as demand, area size, duct layer networks (consisting of ducts, manholes, tunnels, feeder points etc.), it is necessary to develop a cable network designing tool with user-friendly interfaces for efficiently evaluating cable network architectures. This paper firstly proposes the heuristic algorithms enhanced by the disjoint-shortest-path and the depth-first-search methods that would be applicable for real access networks. Secondly, the design method of highly reliable optical fiber cable network based on the heuristic algorithms in terms of network cost and unavailability caused by cable breakdown is proposed. It can design the combination of star- and loop-shaped (where two diversified routes exist between a feeder point and central office) cable network. Furthermore, comparison with the conventional design method which simply applies star- or loop-shaped cable network is done in terms of economy and reliability on real access networks in the Tokyo metropolitan area. It is concluded that the proposed method can reduce the network cost further and realize a short unavailability value compared with the conventional method.

When communication network planning-design is performed, especially in a short-term case, it is important to utilize existing facilities in the construction of the new network. In this paper, link capacity assignment problem (CA problem) for packet-switched networks is investigated with the consideration of the existing network. To deal with this, per-unit cost of existing link capacity is thought to be less than that of newly installed capacity and a link cost function is modeled by a non-linear, non-differentiable one which is composed of two portions of capacity cost. After formulating the CA problem, two optimum algorithms derived from Lagrange multiplier method are presented and a modified algorithm is used for solving the CA problem in order to reduce the computation time. Some numerical results show that according to the values of link traffic flows, there will be links whose capacities must be set equally to the existing values. Moreover, when link cost difference is introduced in the CA problem, the number of links that the capacities of which have to be changed from existing values is less than that of linear cost function case, i.e., the case without consideration of the cost difference in link capacity.

This paper studies routing methods for the complete broadcast multipoint-to-multipoint communication. For a Z-node (Z-site) of the participants of the connection, each site transmits one signal and receives Z-1 signals. The routing method based on connecting each participant by multiple directed point-to-point circuits uses wasteful bandwidth that the source-to-destination data may be duplicated needlessly. We propose routing methods that the connection approach is based on setting multicast tree routes that each participant (site) has one own multicast tree connecting to the other participants under two constraints: the delay-bounded constraint of source-destination path and the available constrained bandwidth for the service of links. For this routing approach, we propose both heuristic algorithm finding approximate solution and search enumeration based algorithm finding optimal solution, and compare the approximate solution with the optimal solution. This approach can lower costs for the subscribers and conserves bandwidth resources for the network providers.